翻訳と辞書 |
Myhill congruence : ウィキペディア英語版 | Syntactic monoid In mathematics and computer science, the syntactic monoid ''M''(''L'') of a formal language ''L'' is the smallest monoid that recognizes the language ''L''. ==Syntactic quotient== Given of a monoid ''M'' of every string over some alphabet, one may define sets that consist of formal left or right inverses of elements in ''S''. These are called quotients, and one may define right or left quotients, depending on which side one is concatenating. Thus, the right quotient of ''S'' by an element is the set : Similarly, the left quotient is :
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Syntactic monoid」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|